Obstructions to a small hyperbolicity in Helly graphs
نویسندگان
چکیده
It is known that for every graph G there exists the smallest Helly graph H(G) into which G isometrically embeds (H(G) is called the injective hull of G) such that the hyperbolicity of H(G) is equal to the hyperbolicity of G. Motivated by this, we investigate structural properties of Helly graphs that govern their hyperbolicity and identify three isometric subgraphs of the King-grid as structural obstructions to a small hyperbolicity in Helly graphs.
منابع مشابه
Helly $\mathbf{EPT}$ graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition
The edge intersection graph of a family of paths in host tree is called an EPT graph. When the host tree has maximum degree h, we say that G belongs to the class [h, 2, 2]. If, in addition, the family of paths satisfies the Helly property, then G ∈ Helly [h, 2, 2]. The time complexity of the recognition of the classes [h, 2, 2] inside the class EPT is open for every h > 4. In [6], Golumbic et a...
متن کاملBiclique-Helly Graphs
A graph is biclique-Helly when its family of (maximal) bicliques is a Helly family. We describe characterizations for biclique-Helly graphs, leading to polynomial time recognition algorithms. In addition, we relate biclique-Helly graphs to the classes of clique-Helly, disk-Helly and neighborhood-Helly graphs.
متن کاملOn the Hyperbolicity of Small-World and Tree-Like Random Graphs
Hyperbolicity is a property of a graph that may be viewed as being a “soft” version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in Internet and related data applications have hyperbolic properties. Here, we consider Gromov’s notion of δ-hyperbolicity, and we establish several positive and negative results for small-world and tree-like random graph...
متن کاملNormal Helly circular-arc graphs and its subclasses
A Helly circular-arc modelM = (C,A) is a circle C together with a Helly family A of arcs of C. If no arc is contained in any other, thenM is a proper Helly circular-arc model, if every arc has the same length, then M is a unit Helly circular-arc model, and if there are no two arcs covering the circle, thenM is a normal Helly circular-arc model. A Helly (resp. proper Helly, unit Helly, normal He...
متن کاملMinimal Obstructions for Partial Representations of Interval Graphs
Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. Two linear-time algorithms are known for solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.02837 شماره
صفحات -
تاریخ انتشار 2017